package com.l;

/**
 * Given an array of integers, return indices of the two numbers such that they add up to a specific target.
 * <p>
 * You may assume that each input would have exactly one solution, and you may not use the same element twice.
 * <p>
 * Example:
 * <p>
 * Given nums = [2, 7, 11, 15], target = 9,
 * <p>
 * Because nums[0] + nums[1] = 2 + 7 = 9,
 * return [0, 1].
 */
public class Two_Sum {

    public static int[] twoSum(int[] nums, int target) {
        for (int i = 0; i < nums.length; i++) {
            for (int j = i + 1; j < nums.length; j++) {
                if (j >= nums.length) {
                    continue;
                }
                if (nums[i] + nums[j] == target) {
                    return new int[]{i, j};
                }
            }
        }
        return new int[]{};
    }

    public static void main(String[] args) {
        int[] nums = {3,2,3};
        int target = 6;
        int[] ints = twoSum(nums, target);
        for (int i : ints) {
            System.out.print(i);
        }
    }
}

/**
 * public int[] twoSum(int[] numbers, int target) {
 *     int[] result = new int[2];
 *     Map<Integer, Integer> map = new HashMap<Integer, Integer>();
 *     for (int i = 0; i < numbers.length; i++) {
 *         if (map.containsKey(target - numbers[i])) {
 *             result[1] = i + 1;
 *             result[0] = map.get(target - numbers[i]);
 *             return result;
 *         }
 *         map.put(numbers[i], i + 1);
 *     }
 *     return result;
 * }
 */
